On Discrete Hessian Matrix and Convex Extensibility
نویسندگان
چکیده
For functions defined on integer lattice points, discrete versions of the Hessian matrix have been considered in various contexts. In discrete convex analysis, for example, certain combinatorial properties of the discrete Hessian matrices are known to characterize M-convex and L-convex functions, which can be extended to convex functions in real variables. The relationship between convex extensibility and discrete Hessian matrices is not fully understood in general, and unfortunately, some vague or imprecise statements have been made in the literature. This note points out that the positive semidefiniteness of the discrete Hessian matrix does not imply nor is implied by convex extensibility of discrete functions.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete Hessian Matrix for L-convex Functions
L-convex functions are nonlinear discrete functions on integer points that are computationally tractable in optimization. In this paper, a discrete Hessian matrix and a local quadratic expansion are defined for L-convex functions. We characterize L-convex functions in terms of the discrete Hessian matrix and the local quadratic expansion.
متن کاملA class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions
In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...
متن کاملApproximating optimization problems over convex functions
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in H(Ω), and optimizing functionals arising from some problems in economics. In the continuous setting and assuming smoothness, the convexity constraints may be given locally by asking the Hessian matrix to be positive sem...
متن کاملEdge Detection with Hessian Matrix Property Based on Wavelet Transform
In this paper, we present an edge detection method based on wavelet transform and Hessian matrix of image at each pixel. Many methods which based on wavelet transform, use wavelet transform to approximate the gradient of image and detect edges by searching the modulus maximum of gradient vectors. In our scheme, we use wavelet transform to approximate Hessian matrix of image at each pixel, too. ...
متن کاملOn Convex Functions and the Finite Element Method
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in Hk(Ω), or some problems in economics. In the continuous setting and assuming smoothness, the convexity constraints may be given locally by asking the Hessian matrix to be positive semidefinite, but in maki...
متن کامل